A partition theorem for a large dense linear order
نویسندگان
چکیده
منابع مشابه
un 2 00 5 A partition theorem for a large dense linear order
Let Q κ = (Q, ≤ Q) be a strongly κ-dense linear order of size κ for κ a suitable cardinal. We prove, for 2 ≤ m < ω, that there is a finite value t + m such that the set [Q] m of m-tuples from Q can be divided into t + m many classes, such that whenever any of these classes C is colored with < κ many colors, there is a copy Q * of Q κ such that [Q * ] m ∩ C is monochromatic. As a consequence we ...
متن کاملA partition-based algorithm for clustering large-scale software systems
Clustering techniques are used to extract the structure of software for understanding, maintaining, and refactoring. In the literature, most of the proposed approaches for software clustering are divided into hierarchical algorithms and search-based techniques. In the former, clustering is a process of merging (splitting) similar (non-similar) clusters. These techniques suffered from the drawba...
متن کاملA Partition Theorem for Scattered Order Types
If φ is a scattered order type, μ a cardinal, then there exists a scattered order type ψ such that ψ → [φ] μ,א0 holds. In this note we prove a Ramsey type statement on scattered order types. A trivial fact on ordinals implies the following statement. If μ is an infinite cardinal, then μ → (μ+)1μ. It is less trivial but still easy to show that if φ is an order type, μ a cardinal then there is so...
متن کاملA partition theorem for α - large sets
Working with Hardy hierarchy and the notion of largeness determined by it, we define the notion of a partition of a finite set of natural numbers A = ∪i<mAi being α-large and show that for ordinals α, β < ε0 satisfying suitable assumptions, if A is (ω · α)-large and is partitioned as above and the partition itself is not α-large, then at least one Ai is ω -large. The goal of this paper is to wo...
متن کاملPartition properties of the dense local order and a colored version of Milliken's theorem
We study finite dimensional partition properties of the countable homogeneous dense local order (a directed graph closely related to the order structure of the rationals). Some of our results use ideas borrowed from the partition calculus of the rationals and are obtained thanks to a strengthening of Milliken’s theorem on trees.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Israel Journal of Mathematics
سال: 2009
ISSN: 0021-2172,1565-8511
DOI: 10.1007/s11856-009-0049-2